DIRICHLET PROBLEM FOR POLYNOMIALS ON THE UNIT DISK
نویسندگان
چکیده
منابع مشابه
On the Discrete Unit Disk Cover Problem
Given a set P of n points and a set D of m unit disks on a 2-dimensional plane, the discrete unit disk cover (DUDC) problem is (i) to check whether each point in P is covered by at least one disk in D or not and (ii) if so, then find a minimum cardinality subset D∗ ⊆ D such that the unit disks in D∗ cover all the points in P. The discrete unit disk cover problem is a geometric version of the ge...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولHyperbolic Polynomials and the Dirichlet Problem
This paper presents a simple, self-contained account of G̊arding’s theory of hyperbolic polynomials, including a recent convexity result of Bauschke-Guler-Lewis-Sendov and an inequality of Gurvits. This account also contains new results, such as the existence of a real analytic arrangement of the eigenvalue functions. In a second, independent part of the paper, the relationship of G̊arding’s theo...
متن کاملUnit Disk Cover Problem
Given a set D of unit disks in the Euclidean plane, we consider (i) the discrete unit disk cover (DUDC) problem and (ii) the rectangular region cover (RRC) problem. In the DUDC problem, for a given set P of points the objective is to select minimum cardinality subset D∗ ⊆ D such that each point in P is covered by at least one disk in D∗. On the other hand, in the RRC problem the objective is to...
متن کاملShape Preserving Approximation by Complex Polynomials in the Unit Disk
The purpose of this paper is to obtain new results concerning the preservation of some properties in Geometric Function Theory, in approximation of analytic functions by polynomials, with best approximation types of rates. In addition, the approximating polynomials satisfy some interpolation conditions too.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the Korean Mathematical Society
سال: 2014
ISSN: 1225-1763
DOI: 10.4134/ckms.2014.29.3.415